Best-First and Ten Other Variations of the Interpretation-Tree Model Matching Algorithm
نویسنده
چکیده
The best known control algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm, popularized and extended by Grimson, Lozano-Perez, Huttenlocher and others. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines eleven variations of this algorithm in a search for improved performance, and concludes that a bestrst algorithm has greatly reduced theoretical complexity and runs much faster than the standard algorithm.
منابع مشابه
Performance Comparison of Ten Variations on the Interpretation-Tree Matching Algorithm
The best known algorithm for symbolic model matching in computer vision is the Interpretation Tree search algorithm. This algorithm has a high computational complexity when applied to matching problems with large numbers of features. This paper examines ten variations of this algorithm in a search for improved performance, and concludes that the non-wildcard and hierarchical algorithms have red...
متن کاملNon-wildcard Matching Beats the Interpretation Tree
Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when being applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation o...
متن کاملNon - Wildcard Matching Beats
Probably the best known control algorithm for high-level model matching in computer vision is the Interpretation Tree expansion algorithm, popularized and extended by Grimson and Lozano-Perez. This algorithm has been shown to have a high computational complexity, particularly when applied to matching problems with large numbers of features. This paper introduces a non-wildcard variation on this...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994